重点目标防空作战中多预警机协同探测空域配置

针对重点目标防空作战中预警机空域配置问题,构建了多预警机阵位选择和架数优化配置模型.通过分析重点目标预警线划分,确定预警机防空作战具体任务,从而构建其阵位选择量化模型,并以此为基础,提出了一种在确保自身安全且充分发挥预警机固有探测威力前提下的多预警机并立航线和串接航线空域配置量化模型.实例运算结果表明,该模型能够对比分...     

几何内蕴量对拉伸模具工作面力学性能的影响

曲率、度规不变量、凸凹性等几何内蕴量的不均匀分布直接影响模具的力学性能。本文研究了曲率与变形能、曲率与摩擦耗损功、度规不变量与热辐射、凸凹分布与辐射热通量等几何内蕴量与力学量之间的关系。结果表明:复杂曲面表面高斯曲率的不连续分布将导致表面的变形能、摩擦耗损功出现相应的不连续分布;型面上沿拉伸方向截面线的法曲率越小,摩擦耗损功越大;型面上的热通量会随着拐点数量的增加而增加。这些结果为模具表面优化设计提供了新的理论依据。     

Manpower allocation with time windows and job‐teaming constraints

In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Outsourcing warranty repairs: Dynamic allocation

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

编队协同反导决策方案优选

为了充分地调度好编队全部的抗导资源,实现抗导弹群的成功概率最大,在利用随机服务系统理论对编队协同反导决策方案各指标值进行计算的基础上,将"模糊优选理论"与"协同学原理"有机地结合起来,求解了在反舰导弹到达强度与舰空导弹的单发杀伤概率在不同值的情况下,编队协同反导决策方案的隶属度,为编队指挥员进行反导决策方案的优选提供了科学依据。     

采用多种群搜索策略的微粒群算法调整消磁绕组

目前,常用的消磁系统调整方法一般都是针对舰艇磁场进行的,而较少考虑磁场梯度。为改善舰艇的磁隐身性能,应当同时考虑两者的有效衰减,由此确定的电流优化调整问题为多目标优化问题。为解决该问题,首先采用一种基于多种群搜索策略的微粒群算法分别求解两类目标函数的最优值,并将这两类最优值作为目标函数的归一化常数,然后选取一组适当的权重将多目标优化问题转化为单目标优化问题,并采用多种群微粒群算法求解该单目标优化问题。最后,采用一个典型的消磁系统优化调整问题来验证方法的有效性。实验结果表明:该方法不但能够实现舰船磁信号的削减,同时还能有效抑制舰船磁信号的波动。     

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

水下滑翔机建模与纵向运动控制

水下滑翔机是一种浮力驱动的新型水下航行器,其特殊的驱动方式和结构特点增加了建模和控制分析的复杂度。为获得准确有效的水下运动控制方法,通过滑翔机运动学和动力学分析,建立了较为完善的三维空间数学模型,并进行了合理的假设和简化,得到纵平面内小扰动线性化模型。在此基础上,运用了线性二次型最优控制理论设计了LQR调节器,分析系统对于控制指令的跟踪响应情况。最后针对滑翔机的纵平面运动进行了仿真分析,仿真结果显示,LQR调节器有很好的干扰抑制能力和指令跟踪性能,并准确地描述了纵平面内滑翔机的运动特性。     

基于编队结构特征的海面舰船目标关联方法

为综合利用星载光学成像、星载电子侦察数据对海面舰船编队进行监测,提出了一种基于舰船编队结构特征的二次匹配目标关联算法,通过构造加权二分图进行最优匹配求解。仿真结果表明,该方法在目标定位精度差别较大、目标存在漏检测等情况下相比传统关联算法的匹配正确率有较大提高,证明了算法的有效性。